Configuration graph - PDFSEARCH.IO - Document Search Engine

Configuration graph
Results: 22

#	Item
11	Local Multidimensional Scaling for Nonlinear Dimension Reduction, Graph Drawing, and Proximity Analysis Lisha CHEN and Andreas BUJA In the past decade there has been a resurgence of interest in nonlinear dimension reduct Add to Reading List Source URL: stat.wharton.upenn.edu Language: English - Date: 2009-03-31 11:10:19 Nonlinear dimensionality reduction Multidimensional scaling Dimension reduction Principal component analysis Force-based algorithms Kernel principal component analysis Configuration Eigenvalues and eigenvectors K9 Statistics Multivariate statistics Isomap
12	Guaranteed Scheduling for Switches with Configuration Overhead Brian Towles and William J. Dally Abstract— In this paper we present three algorithms that provide performance guarantees for scheduling switches, such as Add to Reading List Source URL: cva.stanford.edu Language: English - Date: 2005-12-01 13:38:04 Switches Analysis of algorithms Scheduling algorithms Computational complexity theory Scheduling Speedup Time complexity Graph coloring Crossbar switch Theoretical computer science Applied mathematics Mathematics
13	IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 11, NO. 5, OCTOBERGuaranteed Scheduling for Switches With Configuration Overhead Add to Reading List Source URL: cva.stanford.edu Language: English - Date: 2005-12-01 13:38:04 Operations research Planning Graph coloring Switches Scheduling algorithms Speedup Scheduling Edge coloring Railroad switch Theoretical computer science Applied mathematics Mathematics
14	PDF Document Add to Reading List Source URL: darwin.bth.rwth-aachen.de Language: English - Date: 2012-01-17 04:43:03 Configuration graph Determinacy Combinatorial game theory Automata theory Models of computation Finite model theory Game theory Parity game
15	Generic and Automatic Address Configuration for Data ∗ Center Networks Kai Chen⋆† , Chuanxiong Guo† , Haitao Wu† , Jing Yuan‡⋆ , Zhenqian Feng♯† , Yan Chen⋆ , Songwu Lu§ , Wenfei Wu♮† Add to Reading List Source URL: www.cse.ust.hk Language: English - Date: 2010-06-19 17:44:26 Network theory Network topology Topology Node Shortest path problem Distributed computing Connectivity Flow network Storage area network Graph theory Mathematics Theoretical computer science
16	Steiner trees and spanning trees in six-pin soap films Prasun Dutta1 , S. Pratik Khastgir and Anushree Roy Department of Physics and Meteorology, Indian Institute of Technology, Kharagpur[removed], INDIA arXiv:0806.1340v1 Add to Reading List Source URL: arxiv.org Language: English - Date: 2008-06-15 12:18:40 Steiner tree problem Spanning tree Triangles Steiner points Tree Area Configuration Steiner chain Graph theory Geometry Mathematics
17	MDE-based Sensor Management and Verification for a Self-Driving Miniature Vehicle Md Abdullah Al Mamun, Christian Berger, and Jörgen Hansson Chalmers \| University of Gothenburg, Sweden Department of Computer Science and Add to Reading List Source URL: www.dsmforum.org Language: English - Date: 2013-10-21 17:24:41 Wireless sensor network Technology Configuration graph Sensor node Prolog Model-based testing Programming language theory Computing Embedded systems Wireless networking
18	Journal of Artificial Intelligence Research[removed] Submitted 08/09; published[removed]Interactive Cost Configuration Over Decision Diagrams Henrik Reif Andersen Add to Reading List Source URL: www.jair.org Language: English - Date: 2010-02-27 15:21:10 Diagrams Theoretical computer science Binary decision diagram Model checking Directed acyclic graph Constraint satisfaction problem Static single assignment form Optimization problem Applied mathematics Boolean algebra Constraint programming Mathematics
19	Configuration as Composite Constraint Satisfaction Add to Reading List Source URL: aaai.org Language: English - Date: 2006-01-11 03:10:36 Computing Constraint satisfaction problem Constraint satisfaction Local consistency Constraint graph Mathematical optimization Search algorithm Constraint Decomposition method Constraint programming Software engineering Computer programming
20	Distance functions on random geometric graphs uniform density. If we build an unweighted kNN graph based on this data and apply Isomap to recover the point configuration, we get the figure on the right. Obviously, it is Add to Reading List Source URL: www.is.tuebingen.mpg.de Language: English - Date: 2012-12-21 09:36:16 Graph Shortest path problem Distance Median graph Graph theory Mathematics Theoretical computer science

UPDATE